Computing the Uncertainty of Geometric Primitives and Transformations
نویسندگان
چکیده
In this work we present the uncertainty transformation and its properties and apply these in a frequently encountered problem in computer vision: the alignment problem. A convex polytope is used to captivate the uncertainty of transformations that arises when the position of image points is not exactly known. The uncertainty polytope is used to compute the correspondences between points on the source and the image object. The computation can be made faster when rectangular uncertainty regions are used by splitting up the problem. We show how to efficiently compute the minimal size of an uncertainty region for a given set of point correspondences as a similarity measure in the alignment procedure. Our alignment method is illustrated by an application involving the recognition of plant leaves in digital images. Finally, we present a new method for the computation of the transformation parameters: these are obtained through fitting planes. Keywords—Geometric uncertainty, image transformation
منابع مشابه
Probabilities and statistics on Riemannian manifolds: Basic tools for geometric measurements
Measurements of geometric primitives, such as rotations or rigid transformations, are often noisy and we need to use statistics either to reduce the uncertainty or to compare measurements. Unfortunately, geometric primitives often belong to manifolds and not vector spaces. We have already shown [9] that generalizing too quickly even simple statistical notions could lead to paradoxes. In this ar...
متن کاملSEIMCHA: a new semantic image CAPTCHA using geometric transformations
As protection of web applications are getting more and more important every day, CAPTCHAs are facing booming attention both by users and designers. Nowadays, it is well accepted that using visual concepts enhance security and usability of CAPTCHAs. There exist few major different ideas for designing image CAPTCHAs. Some methods apply a set of modifications such as rotations to the original imag...
متن کاملError Propagation through Geometric Transformations
We investigate the propagation of errors through geometric transformations, such as reflections, rotations, similarity transformations, and projections, and also the scalar product of vectors. This means computing tolerance zones of points which undergo such transformations, if these points and the transformations themselves are given by toleranced input data.
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کامل